Vector Approximation Bitmap Indexing Method for High Dimensional Multimedia Database
نویسندگان
چکیده
منابع مشابه
Vector Approximation based Indexing for High-Dimensional Multimedia Databases
the proliferation of multimedia data, there is an increasing need to support the indexing and searching of high-dimensional data. In this paper, we propose an efficient indexing method for high-dimensional multimedia databases using the filtering approach, known also as vector approximation approach which supports the nearest neighbor search efficiently. Our technique called RA +-Blocks (Region...
متن کاملA Hierarchical Bitmap Indexing Method for Similarity Search in High-Dimensional Multimedia Databases
This paper proposes an efficient indexing mechanism for similarity search in highdimensional multimedia database that quickly filter-outs the irrelevant objects using a novel indexing structure, called HBI (Hierarchical Bitmap Index). In this bitmap index, the feature (or attribute) value of object at each dimension is represented with a set of two bits each of which indicates whether it is rel...
متن کاملHigh-Dimensional Indexing for Multimedia Features
Efficient content-based similarity search in large multimedia databases requires efficient query processing algorithms for many practical applications. Especially in high-dimensional spaces, the huge number of features is a challenge to existing indexing structures. Due to increasing overlap with growing dimensionality, they eventually fail to deliver runtime improvements. In this work, we prop...
متن کاملIndexing High Dimensional Rectangles for Fast Multimedia Identification
This paper addresses the problem of quickly performing point queries against high-dimensional regions. Such queries are useful in the increasingly important problems of multimedia identification and retrieval, where different database entries have different metrics for similarity. While the database literature has focused on indexing for high-dimensional nearest neighbor and epsilon range queri...
متن کاملIndexing Sub-Vector Distance for High-Dimensional Feature Matching
High-dimensional feature matching based on nearest neighbors search is a core part of many image-matching based problems in computer vision which are solved by local invariant features. In this paper, we propose a new indexing structure for the high-dimensional feature matching, which is based on the distance of the sub-vectors. In addition, we employ an effective image-similarity measure of tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartD
سال: 2006
ISSN: 1598-2866
DOI: 10.3745/kipstd.2006.13d.4.455